On approximate pattern matching with thresholds

Approximate Pattern Matching with Samples

We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simpli ed algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to the two-dimensional approximate pattern match...

Improved Approximate Pattern Matching on Hypertext

The problem of approximate pattern matching on hypertext is defined and solved by Amir et al. in O(m(n log m + e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(mk(n + e)) time and needs only O(n) extra space, where k < m is the number of allowed errors in the patter...

Improved Approximate Pattern Matching on Hypertext 3

The problem of approximate pattern matching on hypertext is deened and solved by Amir et al. in O(m(n log m + e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(mk(n + e)) time and needs only O(n) extra space, where k < m is the number of allowed errors in the pattern...

Approximate Pattern Matching with Grey Scale Values

Approximate Pattern Matching with Index Structures

The aim of this thesis is to provide an overview of the practical performance of index structures and algorithms for approximate pattern matching (APM) depending on the properties of the input. APM is the problem of searching a pattern in a text or biological sequence tolerating some errors (e. g. spelling mistakes or genetic mutations). In the offline variant, the text can be preprocessed to b...